The weighted farthest color Voronoi diagram on trees and graphs
نویسندگان
چکیده
منابع مشابه
The weighted farthest color Voronoi diagram on trees and graphs
! " # %$ & #' )(* +, ( *. # $/( #0 213 4 " #65/ )( 7986 $. /$ : %(* ; % ;% %$ % " =<> %(* ? @ A B$ ;% # 7DC E F % $ , =$ ;% GIH KJ L@ @ M F# 4 F F = N $ % : ;%(* # /+O #, P$ * ) Q # $ % * L@ + ) SR9 # * ) * ) ) ( #0 -T % </ ) $0 B $. ' * % U + 1V ;% * )(* W P ) # (* % * A +W @ / =</ %$0 X % / ?$ ;% Q P +W P+Y )# ) Q ,$ *;% # 7
متن کاملThe Farthest Color Voronoi Diagram and Related Problems
Suppose there are k types of facilities, e. g. schools, post offices, supermarkets, modeled by n colored points in the plane, each type by its own color. One basic goal in choosing a residence location is in having at least one representative of each facility type in the neighborhood. In this paper we provide algorithms that may help to achieve this goal for various specifications of the term “...
متن کاملOn the Farthest Line-Segment Voronoi Diagram
The farthest line-segment Voronoi diagram shows properties surprisingly different than the farthest point Voronoi diagram: Voronoi regions may be disconnected and they are not characterized by convexhull properties. In this paper we introduce the farthest line-segment hull, a cyclic structure that relates to the farthest line-segment Voronoi diagram similarly to the way an ordinary convex hull ...
متن کاملThe Geodesic Farthest-point Voronoi Diagram in a Simple Polygon
Given a set of point sites in a simple polygon, the geodesic farthest-point Voronoi diagram partitions the polygon into cells, at most one cell per site, such that every point in a cell has the same farthest site with respect to the geodesic metric. We present an O(n log log n+m logm)time algorithm to compute the geodesic farthest-point Voronoi diagram of m point sites in a simple n-gon. This i...
متن کاملThe L∞ (L1) Farthest Line-Segment Voronoi Diagram
We present structural properties of the farthest line-segment Voronoi diagram in the piecewise linear L∞ and L1 metrics, which are computationally simpler than the standard Euclidean distance and very well suited for VLSI applications. We introduce the farthest line-segment hull, a closed polygonal curve that characterizes the regions of the farthest line-segment Voronoi diagram, and is related...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2004
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2003.07.003